A characterization of Grassmann graphs
نویسندگان
چکیده
منابع مشابه
Reciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملreciprocal degree distance of grassmann graphs
recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.
متن کاملOn the metric dimension of Grassmann graphs
The metric dimension of a graph Γ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph Gq(n,k) (whose vertices are the k-subspaces of Fq, and are adjacent if they intersect in a (k− 1)-subspace) for k ≥ 2. We find an upper bound on its metric dimension, which is ...
متن کاملModular adjacency algebras of Grassmann graphs
The adjacency algebra of an association scheme is defined over an arbitrary field. In general, it is always semisimple over a field of characteristic zero but not always semisimple over a field of positive characteristic. The structures of adjacency algebras over fields of positive characteristic have not been sufficiently studied. In this paper, we consider the structures of adjacency algebras...
متن کاملIsometric embeddings of Johnson graphs in Grassmann graphs
Let V be an n-dimensional vector space (4 ≤ n < ∞) and let Gk(V ) be the Grassmannian formed by all k-dimensional subspaces of V . The corresponding Grassmann graph will be denoted by Γk(V ). We describe all isometric embeddings of Johnson graphs J (l,m), 1 < m < l − 1 in Γk(V ), 1 < k < n − 1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J (n, k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1995
ISSN: 0195-6698
DOI: 10.1016/0195-6698(95)90045-4